Operators near Completely Polynomially Dominated Ones and Similarity Problems

نویسنده

  • C. BADEA
چکیده

Let T and C be two Hilbert space operators. We prove that if T is near, in a certain sense, to an operator completely polynomially dominated with a finite bound by C, then T is similar to an operator which is completely polynomially dominated by the direct sum of C and a suitable weighted unilateral shift. Among the applications, a refined Banach space version of Rota similarity theorem is given and partial answers to a problem of K. Davidson and V. Paulsen are obtained. The latter problem concerns CAR-valued Foguel-Hankel operators which are generalizations of the operator considered by G. Pisier in his example of a polynomial bounded operator not similar to a contraction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ten Problems in Hilbert

PREFACE 1. CONVERGENT. Does the set of cyclic operators have a non-empty interior?... 2. WEIGHTED. Is every part of a weighted shift similar to a weighted shift?. . . . 3. INVARIANT. If an intransitive operator has an inverse, is its inverse also intransitive? 4. TRIANGULAR. Is every normal operator the sum of a diagonal operator and a compact one? 5. DILATED. Is every subnormal Toeplitz operat...

متن کامل

On the use of Heronian means in a similarity classifier

This paper introduces new similarity classifiers using the Heronian mean, and the generalized Heronian mean operators. We examine the use of these operators at the aggregation step within the similarity classifier. The similarity classifier was earlier studied with other operators, in particular with an arithmetic mean, generalized mean, OWA operators, and many more. The two classifiers here ar...

متن کامل

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

A new method to determine a well-dispersed subsets of non-dominated vectors for MOMILP ‎problem

Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...

متن کامل

Non-Elitist Genetic Algorithm as a Local Search Method

The genetic algorithm (GA) proposed by J. Holland [10] is a randomized heuristic search method, based on analogy with the genetic mechanisms observed in nature and employing a population of tentative solutions. Different modifications of GA are widely used in the areas of operations research pattern recognition, artificial intelligence etc. (see e.g. [13, 16]). Despite of numerous experimental ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008